Search results for " Conjugacy"

Some problems about products of conjugacy classes in finite groups

2020

[EN] We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that have only been partially solved.

A note on renewal systems

1992

Abstract A renewal system is a symbolic dynamical system generated by free concatenations of a finite set of words. In this paper we prove that, given two systems which are both renewal and Markov systems, it is decidable whether they are topologically conjugate. The proof makes use of the methods and the techniques of formal language theory.

Generalized iterated function systems on the spacel∞(X)

2014

Abstract In the last decades there has been a current effort to extend the classical Hutchinson theory of iterated function systems composed by contractions on a metric space X into itself to more general spaces and infinitely many mappings. In this paper we consider the (countable) iterated function systems consisting of some generalized contractions on the product space X I into X , where I is an arbitrary set of natural numbers. Some approximations of the attractors of the respective iterated function systems are given.

Topological classification of gradient-like diffeomorphisms on 3-manifolds

2004

Abstract We give a complete invariant, called global scheme , of topological conjugacy classes of gradient-like diffeomorphisms, on compact 3-manifolds. Conversely, we can realize any abstract global scheme by such a diffeomorphism.

A simple algorithm for generating neuronal dendritic trees

1990

Abstract A simple, efficient algorithm is presented for generating the codewords of all neuronal dendritic trees with a given number of terminal nodes. Furthermore, a procedure is developed for deciding if different codewords correspond to topologically equivalent trees.

Powers of conjugacy classes in a finite groups

2020

[EN] The aim of this paper is to show how the number of conjugacy classes appearing in the product of classes affect the structure of a finite group. The aim of this paper was to show several results about solvability concerning the case in which the power of a conjugacy class is a union of one or two conjugacy classes. Moreover, we show that the above conditions can be determined through the character table of the group.

Suffixes, Conjugates and Lyndon Words

2013

In this paper we are interested in the study of the combinatorial aspects connecting three important constructions in the field of string algorithms: the suffix array, the Burrows-Wheeler transform (BWT) and the extended Burrows-Wheeler transform (EBWT). Such constructions involve the notions of suffixes and conjugates of words and are based on two different order relations, denoted by $\plex$ and $\pom$, that, even if strictly connected, are quite different from the computational point of view. In this study an important role is played by Lyndon words. In particular, we improve the upper bound on the number of symbol comparisons needed to establish the $\pom$ order between two primitive wo…

On $MC$-hypercentral triply factorized groups

2007

A group G is called triply factorized in the product of two subgroups A, B and a normal subgroup K of G ,i fG = AB = AK = BK. This decomposition of G has been studied by several authors, investigating on those properties which can be carried from A, B and K to G .I t is known that if A, B and K are FC-groups and K has restrictions on the rank, then G is again an FC-group. The present paper extends this result to wider classes of FC-groups. Mathematics Subject Classification: 20F24; 20F14

MBPT for the Green's function

2013

Combinatorial Models in the Topological Classification of Singularities of Mappings

2018

The topological classification of finitely determined map germs \(f:(\mathbb R^n,0)\rightarrow (\mathbb R^p,0)\) is discrete (by a theorem due to R. Thom), hence we want to obtain combinatorial models which codify all the topological information of the map germ f. According to Fukuda’s work, the topology of such germs is determined by the link, which is obtained by taking the intersection of the image of f with a small enough sphere centered at the origin. If \(f^{-1}(0)=\{0\}\), then the link is a topologically stable map \(\gamma :S^{n-1}\rightarrow S^{p-1}\) (or stable if (n, p) are nice dimensions) and f is topologically equivalent to the cone of \(\gamma \). When \(f^{-1}(0)\ne \{0\}\)…